Rapid transactional level simulation of multiprocessor systems⋆
نویسندگان
چکیده
We present a framework for modelling and performance estimation of multiprocessor embedded systems. It consists of components for modelling parallel software and multiprocessor hardware; and Systemcbased tool for simulation and performance estimation. The components model are a transactional level description of hardware and software, where timing properties are modelled as annotations on the concurrency model. The experiments carried out on several real-life industrial-size applications show that our framework achieves rapid simulation. keyword: Multiprocessor, Simulation, TLM, Performance Estimation
منابع مشابه
Building and Using the ATLAS Transactional Memory System
At WARFP 2005, we proposed ATLAS as a scalable implementation for transactional parallel systems [5]. The impetus for the development of ATLAS is to address the significant hurdles that software simulators face in multiprocessor architectural research. In particular, ATLAS is an FPGA-based system that primarily serves as a rapid software development platform for our transactional memory model, ...
متن کاملMisse: a Multi-level Intelligent Synthesis and Simulation Environment
Multi-level Intelligent Synthesis and Simulation Environment (MISSE) is an object-oriented, top-down, high-level design environment for multiprocessor systems. Three important aspects of multiprocessor system design: modeling, synthesis, and simulation are supported in MISSE. First, multiprocessor systems are hierarchically classified and system parts modeled as objects with interrelationships....
متن کاملTowards Transactional Memory for Real-Time Systems
In this paper, we explore a new synchronization paradigm for real-time systems: transactional memory for real-time systems. Transactional memory is considered as a solution for parallel programs on a shared memory chip multiprocessor. It simplifies the programming model and increases the average case throughput. However, in real-time systems we are interested in the worst-case execution time. I...
متن کاملArchitectural Transactional Memory: Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems associated with conventional locking techniques, including priority inversion, convoying, and difficu...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کامل